Normalized Completion Revisited
نویسندگان
چکیده
Normalized completion (Marché 1996) is a widely applicable and efficient technique for completion modulo theories. If successful, a normalized completion procedure computes a rewrite system that allows to decide the validity problem using normalized rewriting. In this paper we consider a slightly simplified inference system for finite normalized completion runs. We prove correctness, show faithfulness of critical pair criteria in our setting, and propose a different notion of normalizing pairs. We then show how normalized completion procedures can benefit from ACtermination tools instead of relying on a fixed AC-compatible reduction order. We outline our implementation of this approach in the completion tool mkbtt and present experimental results, including new completions. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems
منابع مشابه
Normalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations
In a rst part, we introduce normalized rewriting, a new rewrite relation. It generalizes former notions of rewriting modulo a set of equations E, dropping some conditions on E. For example, E can now be the theory of identity, idempotence, the theory of Abelian groups or the theory of commutative rings. We give a new completion algorithm for normalized rewriting. It contains as an instance the ...
متن کاملAC-KBO Revisited
We consider various definitions of AC-compatible KnuthBendix orders. The orders of Steinbach and of Korovin and Voronkov are revisited. The former is enhanced to a more powerful AC-compatible order and we modify the latter to amend its lack of monotonicity on non-ground terms. We further present new complexity results. An extension reflecting the recent proposal of subterm coefficients in stand...
متن کاملCompletion-of-squares: Revisited and extended
Due to its simplicity, the completion-of-squares technique is quite popular in linear optimal control. However, this simple technique is limited to linear quadratic Gaussian systems. In this note, by interpreting the completion-ofsquares from a new angle, we extend this technique to performance optimization of general Markov systems with the long run average criterion, leading to a new approach...
متن کاملThe Order Completion Method for Systems of Nonlinear PDEs Revisited
In this paper we presents further developments regarding the enrichment of the basic Theory of Order Completion as presented in (Oberguggenberger and Rosinger, 1994). In particular, spaces of generalized functions are constructed that contain generalized solutions to a large class of systems of continuous, nonlinear PDEs. In terms of the existence and uniqueness results previously obtained for ...
متن کامل